
/*
 *
 * Copyright (c) 2006 P.J.Leonard
 * 
 * http://www.frinika.com
 * 
 * This file is part of Frinika.
 * 
 * Frinika is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.

 * Frinika is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.

 * You should have received a copy of the GNU General Public License
 * along with Frinika; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
package sane;

/**
 *
 * @author pjl
 */
public class RandomSearch {

    public static void main(String args[]) {

        float best = 0.0f;
        float fitness = 0.0f;

        Context c = new Context();


        Gene genes[] = new Gene[c.ZETA];

        for (int i = 0; i < c.MAX_GENERATIONS*1000; i++) {

            for (int j = 0; j < c.ZETA; ++j) {
                genes[j] = new Gene(c.bitsPerGene, true);
            }

            Network net = Builder.build(genes, c);
            CartSim sim = new CartSim();

            fitness = sim.run(net, c.MAX_STEPS, true);
       //     System.out.println(" fit (best)=" + fitness + " ("+best+")");
            if (fitness >= c.MAX_STEPS) {
                for (int k=0;k<10;k++){
                    float fit2=sim.run(net, c.MAX_STEPS, true);
                    System.out.println(" fit2="+ fit2);
                    fitness=Math.min(fitness, fit2);
                }
            }
            if (fitness > best) {
                best = fitness;
                System.out.println(" Best was =" + best + " ("+i+")");
            }
        }
      
    }
}
